github.com/andybalholm/brotli.hasherSearchResult.score (field)

31 uses

	github.com/andybalholm/brotli (current package)
		backward_references.go#L76: 		sr.score = kMinScore
		backward_references.go#L78: 		if sr.score > kMinScore {
		backward_references.go#L91: 				sr2.score = kMinScore
		backward_references.go#L94: 				if sr2.score >= sr.score+cost_diff_lazy {
		h5.go#L118: 	var min_score uint = out.score
		h5.go#L119: 	var best_score uint = out.score
		h5.go#L161: 						out.score = best_score
		h5.go#L201: 						out.score = best_score
		h5.go#L211: 	if min_score == out.score {
		h6.go#L120: 	var min_score uint = out.score
		h6.go#L121: 	var best_score uint = out.score
		h6.go#L163: 						out.score = best_score
		h6.go#L203: 						out.score = best_score
		h6.go#L213: 	if min_score == out.score {
		hash.go#L41: 	score          uint
		hash.go#L150: 	if score < out.score {
		hash.go#L157: 	out.score = score
		hash_forgetful_chain.go#L161: 	var min_score uint = out.score
		hash_forgetful_chain.go#L162: 	var best_score uint = out.score
		hash_forgetful_chain.go#L198: 						out.score = best_score
		hash_forgetful_chain.go#L240: 						out.score = best_score
		hash_forgetful_chain.go#L249: 	if out.score == min_score {
		hash_longest_match_quickly.go#L120: 	var min_score uint = out.score
		hash_longest_match_quickly.go#L121: 	var best_score uint = out.score
		hash_longest_match_quickly.go#L138: 					out.score = best_score
		hash_longest_match_quickly.go#L173: 				out.score = score
		hash_longest_match_quickly.go#L202: 					out.score = score
		hash_longest_match_quickly.go#L209: 	if h.useDictionary && min_score == out.score {
		hash_rolling.go#L155: 						if score > out.score {
		hash_rolling.go#L158: 							out.score = score